-
1 straightforward enumeration
Большой англо-русский и русско-английский словарь > straightforward enumeration
-
2 straightforward enumeration
Математика: прямой перебор (вариантов)Универсальный англо-русский словарь > straightforward enumeration
-
3 straightforward enumeration
English-Russian scientific dictionary > straightforward enumeration
-
4 прямой перебор
Большой англо-русский и русско-английский словарь > прямой перебор
-
5 method
метод; процедура; способ- antithetic variate method - average ordinate method - average range method - binary search method - conjugate directions method - conjugate gradient method - control chart method - conventional milling method - correlation function method - decision function method - differential control method - Feynman diagram method - first approximation method - gradient projection method - iterative method - large sample method - large sieve method - least-squares regression method - less than fully efficient method - linearly implicit method - method of adjoint gradient - method of algebraic addition - method of alternating directions - method of balanced blocks - method of complex numbers - method of confidence intervals - method of conformal mappings - method of conjugate directions - method of conjugate gradients - method of cyclic descent - method of detached coefficients - method of disjunction of cases - method of divided differences - method of electrical images - method of elimination of quantifiers - method of empty ball - method of extreme values - method of false position - method of feasible directions - method of finite differences - method of first approximation - method of first entrance - method of fitting constants - method of fixed points - method of full enumeration - method of generating functions - method of geometric exhaustion - method of indefinite coefficients - method of infinite descent - method of interval bisection - method of least absolute values - method of least distance - method of least likelihood - method of maximum likelihood - method of means and standard deviations - method of medians and extreme values - method of minimal change - method of minimal variance - method of mirror reflections - method of moving frame - method of multiple comparison - method of orthogonal projections - method of paired associates - method of paired comparisons - method of phase integrals - method of projecting cones - method of proportional parts - method of rotating factors - method of semantic tableaux - method of separation of variables - method of simulaneous displacements - method of stationary phase - method of statistical differentials - method of statistical inference - method of steep variations - method of steepest ascent - method of stochastic approximation - method of straightforward iteration - method of successive displacements - method of successive divisions - method of successive elimination - method of transfinite induction - method of unweighted means - method of variable differences - method of variation of parameters - method of weighted residuals - optimum method - parallel tangents method - precision method - random walk method - recursive method - reduced gradient method - reflected wave method - relative method of measurement - sampling method by variables - statistical sampling method - steepest descent method - time average method -
6 procedure
1) мероприятие2) метод; методика4) операция5) компьют. подпрограмма6) процедура, порядок выполнения7) процесс• -
7 proof
1) доказательство; обоснование; подтверждение2) полигр. корректура, пробный оттиск4) проверка; испытание; проба || проверять; испытывать; опробовать5) безопасный; защищённый6) обеспечивать непроницаемость; герметизировать•proof against — устойчивый к воздействию (какого-л. фактора)
proof by contradiction — мат. доказательство от противного
proof by induction — мат. доказательство по индукции
proof by matrices — мат. доказательство с помощью матриц
proof in outline — набросок [схема] доказательства;
this completes the proof — это завершает доказательство; на этом доказательство заканчивается
- strong proofto give a proof — матем. дать доказательство
См. также в других словарях:
systems engineering — ☆ systems engineering n. a branch of engineering using esp. information theory, computer science, and facts from systems analysis studies to design integrated operational systems for specific complexes systems engineer n. * * * Technique of using … Universalium
NSA warrantless surveillance controversy — For the related controversy about data mining of domestic call records see NSA call database. National Security Agency logo The NSA warrantless surveillance controversy (AKA Warrantless Wiretapping ) concerns surveillance of persons within the… … Wikipedia
Boolean algebra (logic) — For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… … Wikipedia
Word problem for groups — In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a recursively presented group G is the algorithmic problem of deciding whether two words represent the same element. Although it… … Wikipedia
Comparison of Pascal and C — Programming language comparisons General comparison Basic syntax Basic instructions Arrays Associative arrays String operations … Wikipedia
Sacraments — • Presents the necessity, the nature, the origin and cause, the number, the effects, the minister, and the recipient of the Sacraments Catholic Encyclopedia. Kevin Knight. 2006. Sacraments Sacraments … Catholic encyclopedia
Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and … Wikipedia
Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Lutheranism — Luther s Seal Book of Concord … Wikipedia
Recursively enumerable set — In computability theory, traditionally called recursion theory, a set S of natural numbers is called recursively enumerable, computably enumerable, semidecidable, provable or Turing recognizable if: There is an algorithm such that the set of… … Wikipedia